An Accurate Worst Case Timing Analysis for RISC Processors

نویسندگان

  • Sung-Soo Lim
  • Young Hyun Bae
  • Gyu Tae Jang
  • Byung-Do Rhee
  • Sang Lyul Min
  • Chang Yun Park
  • Heonshik Shin
  • Kunsoo Park
  • Soo-Mook Moon
  • Chong-Sang Kim
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Accurate Worst Case Timing Analysis Technique for RISC Processors

An accurate and safe estimation of a task's worst case execution time (WCET) is crucial for reasoning about the timing properties of real-time systems. In RISC processors , the execution time of a program construct (e.g., a statement) is aaected by various factors such as cache hits/misses and pipeline hazards, and these factors impose serious problems in analyzing the WCETs of tasks. To analyz...

متن کامل

Portable Execution Time Analysis for RISC Processors

The knowledge of a task’s worst case execution time (WCET) is required for scheduling real-time tasks. Existing execution time analyzers are machine dependent and this is a serious problem as architectures evolve rapidly. In this paper, we present a tool for portable execution time analysis for RISC processors. This tool generates an execution time analyzer for any RISC processor. The analyzer ...

متن کامل

Retargetable Timing Analyzer for Risc Processors

The objective of this paper is to present a software tool, called retargetable timing analyzer generator (RTAG), which takes as input an architecture description and automatically generates a pipeline an-alyzer to resolve the portability problem. We explain our methodology for worst case execution time analysis and describe how it is reeected in the timing analyzer generator. The generator take...

متن کامل

A Worst Case Timing Analysis Technique for Multiple-Issue Machines

We propose a worst case timing analysis technique for in-order, multiple-issue machines. In the proposed technique, timing information for each program construct is represented by a directed acyclic graph (DAG) that shows dependences among instructions in the program construct. From this information, we derive for each pair of instructions the distance bounds between their issue times. Using th...

متن کامل

Generalizing timing predictions to set-associative caches

Recently, research on the static prediction of worst-case execution time (WCET) of programs has been extended from simple CISC to pipelined RISC processors, and from uncached architectures to direct-mapped instruction caches. This work goes one step further by introducing a framework to handle WCET prediction for set-associative caches. Generalizing the work of static cache simulation of direct...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Software Eng.

دوره 21  شماره 

صفحات  -

تاریخ انتشار 1995